Approximating Clustering Coefficient and Transitivity
نویسندگان
چکیده
منابع مشابه
Approximating Clustering Coefficient and Transitivity
Since its introduction in the year 1998 by Watts and Strogatz, the clustering coefficient has become a frequently used tool for analyzing graphs. In 2002 the transitivity was proposed by Newman, Watts and Strogatz as an alternative to the clustering coefficient. As many networks considered in complex systems are huge, the efficient computation of such network parameters is crucial. Several algo...
متن کاملSingle document Summarization based on Clustering Coefficient and Transitivity Analysis
Document summarization is a technique aimed to automatically extract the main ideas from electronic documents. With the fast increase of electronic documents available on the network, techniques for making efficient use of such documents become increasingly important. In this paper, we propose a novel algorithm, called TriangleSum for single document summarization based on graph theory. The alg...
متن کاملApproximating Transitivity in Directed Networks
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set D ⊂ E and require that a valid solution A satisfies D ⊂ A (it is sometimes called transitive reduction problem). In the second extension (called p-ary trans...
متن کاملThe Transitivity Misconception of Pearson’s Correlation Coefficient
Despite the relevance of correlational studies for most research domains, many students, teachers, and researchers alike hold misconceptions concerning the Pearson product-moment correlation coefficient. One of these, the transitivity misconception, has not yet been documented in a systematic way. This paper summarizes the first empirical study, using 279 university students, and examines the r...
متن کاملClustering Co-occurrence Graph based on Transitivity
Word co-occurrences form a graph, regarding words as nodes and co-occurrence relations as branches. Thus, a co-occurrence graph can be constructed by co-occurrence relations in a corpus. This paper discusses a clustering method of the co-occurrence graph, the decomposition of the graph, from a graph-theoretical viewpoint. Since one of the applications for the clustering results is the ambiguity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2005
ISSN: 1526-1719
DOI: 10.7155/jgaa.00108